On the Computation of Elementary Divisors of Integer Matrices

نویسنده

  • Frank Lübeck
چکیده

The εi are called the elementary divisors of A and à is called the Smith normal form or elementary divisors form of A. In Section 3 we give an algorithm for computing for a given matrix A, its rank r and a prime p the p-parts of the elementary divisors of A. During the algorithm we perform row operations on the matrix A which are driven by only considering certain reductions of row vectors modulo p. The method does not give transforming matrices L and R as in the proposition. A crucial point for the application of our algorithm is that one needs to know the prime numbers dividing εr (or δr). These are often known from the mathematical context. In

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary Divisors of Graphs and Matroids

New integer invariants of a graph G, introduced by U. Oberst, are obtained as the elementary divisors of the Laplacian matrix of G. The theory of elementary divisors is developed in the context of regular matroids. It is shown that the elementary divisors of a graph are actually invariants of its underlying matroid. Regular matroids, in tum, are related to lattices in euclidean space, and this ...

متن کامل

On Cartan matrices and lower defect groups for covering groups of symmetric groups

We determine the elementary divisors of the Cartan matrices of spin p-blocks of the covering groups of the symmetric groups when p is an odd prime. As a consequence, we also compute the determinants of these Cartan matrices, and in particular we confirm a conjecture by Brundan and Kleshchev that these determinants depend only on the weight but not on the sign of the block. The main purpose of t...

متن کامل

The Tangent Cones at Double points of Prym-Canonical Divisors of Curves of genus 7

Let η be a line bundle on a smooth curve X with η^2=0 such that π_η, the double covering induced by η is an etale morphism. Assume also that X_η be the Prym-canonical model of X associated to K_X.η and Q is a rank 4 quadric containing X_η. After stablishing the projective normality of the prym-canonical models of curves X with Clifford index 2, we obtain in this paper a sufficient condition for...

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

Modern Computer Arithmetic (version 0.5.1)

This is a draft of a book about algorithms for performing arithmetic, and their implementation on modern computers. We are concerned with software more than hardware - we do not cover computer architecture or the design of computer hardware. Instead we focus on algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to top...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2002